Protein complex identification by supervised graph local clustering
نویسندگان
چکیده
منابع مشابه
Protein complex identification by supervised graph local clustering
MOTIVATION Protein complexes integrate multiple gene products to coordinate many biological functions. Given a graph representing pairwise protein interaction data one can search for subgraphs representing protein complexes. Previous methods for performing such search relied on the assumption that complexes form a clique in that graph. While this assumption is true for some complexes, it does n...
متن کاملSemi-Supervised Polyphonic Source Identification using PLCA Based Graph Clustering
For identifying instruments or singers in the polyphonic audio, supervised probabilistic latent component analysis (PLCA) is a popular tool. But in many cases individual source audio is not available for training. To address this problem, this paper proposes a novel scheme using semisupervised PLCAwith probabilistic graph clustering, which does not require individual sources for training. The P...
متن کاملApplication Identification using Supervised Clustering Method
The classification of traffic provides essential data for network management and research. Several classification approaches are developed and proposed to protect the network resources or enforce organizational policies. Whereas the port number based classification works only for some well-known applications and payload based classification is not suitable for encrypted packet payloads that mak...
متن کاملExploiting Optimization for Local Graph Clustering
Local graph clustering methods aim to identify well-connected clusters around a given “seed set” of reference nodes. The main focus of prior theoretical work has been on worst-case running time properties or on implicit statistical regularization; and the focus of prior empirical work has been to identify structure in large social and information networks. Here, we adopt an optimization perspec...
متن کاملFlow-Based Algorithms for Local Graph Clustering
Given a subset A of vertices of an undirected graph G, the cut-improvement problem asks us to find a subset S that is similar to A but has smaller conductance. An elegant algorithm for this problem has been given by Andersen and Lang [AL08] and requires solving a small number of single-commodity maximum flow computations over the whole graph G. In this paper, we introduce LocalImprove, the firs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2008
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btn164